Random graphs

Results: 338



#Item
161Graph drawing / Dual graph / Parallel Random Access Machine / Connectivity / Planarity testing / Biconnected component / Graph theory / Planar graphs / Topological graph theory

More Graph Drawing in the Cloud: Data-Oblivious st-Numbering, Visibility Representations, and Orthogonal Drawing of Biconnected Planar Graphs. Michael T. Goodrich, Joseph A. Simons Department of Computer Science, Univers

Add to Reading List

Source URL: www.ics.uci.edu

Language: English - Date: 2012-10-23 15:28:26
162Measure theory / Euclidean plane geometry / Delaunay triangulation / Triangulation / Probability theory / Relative neighborhood graph / N-sphere / Gabriel graph / Support / Geometry / Mathematics / Mathematical analysis

CCCG 2011, Toronto ON, August 10–12, 2011 Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions ∗ Esther M. Arkin†

Add to Reading List

Source URL: 2011.cccg.ca

Language: English - Date: 2011-08-06 04:11:14
163Data mining / Decision trees / K-nearest neighbor algorithm / Cluster analysis / Random forest / K-means clustering / Segmentation / Distance matrix / Decision tree learning / Statistics / Machine learning / Computational statistics

2014 IEEE Conference on Computer Vision and Pattern Recognition Constructing Robust Affinity Graphs for Spectral Clustering Xiatian Zhu1 , Chen Change Loy2 , Shaogang Gong1 1 Queen Mary University of London, London E1

Add to Reading List

Source URL: personal.ie.cuhk.edu.hk

Language: English - Date: 2014-07-02 23:16:31
164Applied mathematics / NP-complete problems / Dominating set / Random graph / Connectivity / Graph / Theoretical computer science / Mathematics / Graph theory

Comparison of Two CDS Algorithms on Random Unit Ball Graphs Jennie C. Hansen∗ Abstract This paper compares asymptotic “average case”performance of two closely related algorithms for finding small connected dominati

Add to Reading List

Source URL: www.siam.org

Language: English - Date: 2005-07-06 08:19:04
165NP-complete problems / Graph coloring / Domatic number / Dominating set / Independent set / Greedy coloring / Topology / Maximal independent set / Graph / Graph theory / Theoretical computer science / Mathematics

CCCG 2010, Winnipeg MB, August 9–11, 2010 Approximating the Independent Domatic Partition Problem in Random Geometric Graphs – An Experimental Study Dhia Mahjoub

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2010-07-19 10:46:18
166Measure theory / Euclidean plane geometry / Delaunay triangulation / Triangulation / Probability theory / Relative neighborhood graph / N-sphere / Gabriel graph / Support / Geometry / Mathematics / Mathematical analysis

CCCG 2011, Toronto ON, August 10–12, 2011 Probabilistic Bounds on the Length of a Longest Edge in Delaunay Graphs of Random Points in d-Dimensions ∗ Esther M. Arkin†

Add to Reading List

Source URL: www.cccg.ca

Language: English - Date: 2011-08-06 04:11:14
167Algebraic graph theory / NP-complete problems / Graph partition / Laplacian matrix / Degree / Random graph / Laplace operator / Adjacency matrix / Tutte polynomial / Mathematics / Graph theory / Mathematical analysis

Journal of Machine Learning Research vol–23 Submitted 24 May 2012; Published 2012 Spectral Clustering of Graphs with General Degrees in the Extended Planted Partition Model

Add to Reading List

Source URL: cseweb.ucsd.edu

Language: English - Date: 2012-06-05 15:17:28
168Structural rigidity / Laman graph / Degeneracy / Connectivity / Tree / Dense graph / Erdős–Rényi model / Pseudoforest / Graph theory / Mathematics / Random graph

CCCG 2009, Vancouver, BC, August 17–19, 2009 Rigid Components of Random Graphs Louis Theran∗ Abstract

Add to Reading List

Source URL: cccg.ca

Language: English - Date: 2009-09-02 14:23:35
169Social networks / Network theory / Watts and Strogatz model / Small-world network / Scale-free network / Connectivity / Topology / Barabási–Albert model / Network topology / Graph theory / Networks / Random graphs

A Small-world Network Where All Nodes Have the Same Connectivity, with Application to the Dynamics of Boolean Interacting Automata

Add to Reading List

Source URL: www.complex-systems.com

Language: English - Date: 2012-09-20 14:36:40
170Networks / Random graphs / Social networks / Network theory / Watts and Strogatz model / Network science / Complex network / Barabási–Albert model / Augmented Lagrangian method / Mathematical optimization / Mathematics / Graph theory

Performance analysis of OFDM modulation on indoor broadband PLC channels

Add to Reading List

Source URL: www.casmodeling.com

Language: English
UPDATE